Orthogonal Variable Spreading Factor Codes over Finite Fields
نویسندگان
چکیده
منابع مشابه
Constacyclic codes over finite fields
An equivalence relation called isometry is introduced to classify constacyclic codes over a finite field; the polynomial generators of constacyclic codes of length lp are characterized, where p is the characteristic of the finite field and l is a prime different from p.
متن کاملImplementation of a High-Performance Assignment Scheme for Orthogonal Variable-Spreading-Factor Codes in WCDMA Networks
In WCDMA, channelization is achieved by assigning OVSF codes to different users. The codes in a Node-B are valuable and limited. Much research has been devoted to devising OVSF code-assignment strategies to support as many users as possible. A number of the strategies suffer from a “code-set fragmentation” problem, which increases the call blocking probability (CBP) on the Node-B. In order to r...
متن کاملLinear covering codes over nonbinary finite fields
For a prime power q and for integers R, η with R > 0, 0 ≤ η ≤ R − 1, let A R,q = (Cni)i denote an infinite sequence of q-ary linear [ni, ni − ri]qR codes Cni with covering radius R and such that the following two properties hold: (a) the codimension ri = Rti + η, where (ti)i is an increasing sequence of integers; (b) the length ni of Ci coincides with f (η) q (ri), where f (η) q is an increasin...
متن کاملGalois LCD codes over finite fields
In this paper, we study the complementary dual codes in more general setting (which are called Galois LCD codes) by a uniform method. A necessary and sufficient condition for linear codes to be Galois LCD codes is determined, and constacyclic codes to be Galois LCD codes are characterized. Some illustrative examples which constacyclic codes are Galois LCD MDS codes are provided as well. In part...
متن کاملMinimal Linear Codes over Finite Fields
As a special class of linear codes, minimal linear codes have important applications in secret sharing and secure two-party computation. Constructing minimal linear codes with new and desirable parameters has been an interesting research topic in coding theory and cryptography. Ashikhmin and Barg showed that wmin/wmax > (q− 1)/q is a sufficient condition for a linear code over the finite field ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
سال: 2021
ISSN: 0916-8508,1745-1337
DOI: 10.1587/transfun.2021eap1001